Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D
نویسندگان
چکیده
The detour and spanning ratio of a graph embedded in measure how well approximates Euclidean space and the complete Euclidean graph, respectively. In this paper we describe time algorithms for computing the detour and spanning ratio of a planar polygonal path. By generalizing these algorithms, we obtain -time algorithms for computing the detour or spanning ratio of planar trees and cycles. Finally, we develop subquadratic algorithms for computing the detour and spanning ratio for paths, cycles, and trees embedded in ! , and show that computing the detour in "! is at least as hard as Hopcroft’s problem. # This research was partly funded by CRM, FCAR, MITACS, and NSERC. P.A. was supported by NSF under grants CCR-00-86013 EIA-99-72879, EIA-01-31905, and CCR-02-04118, by ARO grants W911NF-04-1-0278 and DAAD1903-1-0352, and by a grant from the U.S.-Israeli Binational Science Foundation. R.K. was supported by DFG grant Kl 655/14-1. M.S. was supported by NSF Grants CCR-97-32101 and CCR-00-98246, by a grant from the U.S.-Israeli Binational Science Foundation (jointly with P.A.), by a grant from the Israeli Academy of Sciences for a Center of Excellence in Geometric Computing at Tel Aviv University, and by the Hermann Minkowski–MINERVA Center for Geometry at Tel Aviv University. $ Some of these results have appeared in a preliminary form in [2, 20]. % Department of Computer Science, Duke University, Durham, NC 27708-0129, U.S.A., [email protected]. & Institut für Informatik I, Universität Bonn, Römerstraße 164, D-53117 Bonn, Germany, [email protected]. ' Institut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin, Germany, [email protected]. ( Chercheur qualifié du FNRS, Département d’Informatique, Université Libre de Bruxelles, ULB CP212, boulevard du Triomphe, 1050 Bruxelles, [email protected] # # School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada, [email protected]. $)$ School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel; and Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA. [email protected]. %)% Foreign Exchange Strategy Division, Goldman Sachs, New York, [email protected]
منابع مشابه
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles
The maximum detour and spanning ratio of an embedded graph G are values that measure how well G approximates Euclidean space and the complete Euclidean graph, respectively. In this paper we describe O(n logn) time algorithms for computing the maximum detour and spanning ratio of a planar polygonal path. These algorithms solve open problems posed in at least two previous works [5,10]. We also ge...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملStudy of Sexual Dimorphism in Second-to-fourth Digit Length Ratio (2D: 4D) in the Green-Bellied Lizard (Darevskia cholorogaster) from Iran
Sexual dimorphism in digit ration is related to genetic differences between species in response to prenatal exposure to hormones. In this study, the development of tetrapod digits, preliminary the ratio between the length of digit II and IV (2D: 4D) was investigated in 34 samples of Darevskia cholorogaster in the North of Iran. The results showed no significant differences between sexes in any ...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملنقش دیمورفیسم جنسیتی بر طول نسبی انگشتان دست و تعیین جنسیت جمعیت ایرانی: گزارش کوتاه
Background: Sex determination from human remains is a challenge for forensic experts. Many studies have shown that the finger length ratios might be characteristic for sexual dimorphism. The aim of this study was to determine sexual dimorphism in finger length ratios among Iranian population. Methods: The study group comprised of a random sample of 100 healthy people without congenital or acqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 39 شماره
صفحات -
تاریخ انتشار 2008